The polarization of F 1 strings into D 2 branes : “ Aut Caesar aut nihil 1 ”
نویسنده
چکیده
We give matrix and supergravity descriptions of type IIA F-strings polarizing into cylindrical D2 branes. When a RR four-form field strength F4 is turned on in a supersymmetric fashion (with 4 supercharges) , a complete analysis of the solutions reveals the existence of a moduli space of F1 → D2 polarizations (Caesar) for some fractional strengths of the perturbation, and of no polarization whatsoever (nihil) for all other strengths of the perturbation. This is a very intriguing phenomenon, whose physical implications we can only speculate about. In the matrix description of the polarization we use the Non-Abelian Born-Infeld action in an extreme regime, where the commutators of the fields are much larger than 1. The validity of the results we obtain, provides a direct confirmation of this action, although is does not confirm or disprove the symmetrized trace prescription. Latin for “either Caesar or nothing”
منابع مشابه
Automorphisms of Generalized Thompson Groups
0.1. Results. We study the automorphisms of some generalizations of Thompson’s groups and their underlying structures. The automorphism groups of two of Thompson’s original groups were analyzed in [2] and were shown to be “small” and “unexotic.” Our results differ sharply from [2] in that we show that the automorphism groups of the generalizations are “large” and have “exotic” elements. The ter...
متن کاملSe p 20 06 Upper Bounds on the Automorphism Group of a Graph Discrete Mathematics 256 ( 2002 ) 489 - 493
We give upper bounds on the order of the automorphism group of a simple graph In this note we present some upper bounds on the order of the automorphism group of a graph, which is assumed to be simple, having no loops or multiple edges. Somewhat surprisingly, we did not find such bounds in the literature and the goal of this paper is to fill this gap. As a matter of fact, implicitly such bounds...
متن کاملSe p 20 06 Upper Bounds on the Automorphism Group of a Graph Discrete Mathematics 256 ( 2002 ) 489 - 493 . Ilia
We give upper bounds on the order of the automorphism group of a simple graph In this note we present some upper bounds on the order of the automorphism group of a graph, which is assumed to be simple, having no loops or multiple edges. Somewhat surprisingly, we did not find such bounds in the literature and the goal of this paper is to fill this gap. As a matter of fact, implicitly such bounds...
متن کاملProblems for Problem Session
is its closed normal subgroup, [Sh], [Ka]. The group Aut∗k k [n] is an infinite dimensional simple algebraic group, [Sh]. If D is a locally nilpotent k-derivation of k, then it is easily seen that exp tD ∈ Aut∗k k [n] for any t ∈ k, so D lies in Lie(Aut∗k k ). It follows from [BB1], [BB2] that n − 1 is the maximum of dimensions of algebraic tori contained in Aut∗k k , and that every algebraic t...
متن کاملAutomorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کامل